Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
نویسندگان
چکیده
منابع مشابه
Single Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملScheduling parallel jobs to minimize the makespan
We consider the NP-hard problem of scheduling parallel jobs with release dates on identical parallel machines to minimize the makespan. A parallel job requires simultaneously a prespecified, job-dependent number of machines when being processed. We prove that the makespan of any nonpreemptive list-schedule is within a factor of 2 of the optimal preemptive makespan. This gives the best-known app...
متن کاملScheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan
We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. The objective is to minimize the makespan. We first show that the problem can be solved optimally by 0–1 integer progra...
متن کاملParallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects
A new unrelated parallel machine scheduling problem with deteriorating 26 effect and the objective of makespan minimization is presented in this paper. The 27 deterioration of each machine (and therefore of the job processing times) is a function of the 28 sequence of jobs that have been processed by the machine and not (as considered in the 29 literature) by the time at which each job is assig...
متن کاملSingle-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs
Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs L-H Sun1,2,3, L-Y Sun3,4,5 and J-B Wang2,6∗ 1School of Business Administration, Xi’an University of Technology, Xi’an, People’s Republic of China; 2Knowledge Management & Innovation Research Centre, Xi’an Jiaotong University, Xi’an, People’s Republic of China; 3The State Key Laboratory on M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2007
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2006.01.017